Compactness and Incompactness Phenomena in Set Theory

نویسنده

  • JAMES CUMMINGS
چکیده

We prove two results with a common theme: the tension between compactness and incompactness phenomena in combinatorial set theory. Theorem 1 uses PCF theory to prove a sort of “compactness” for a version of Dzamonja and Shelah’s strong non-reflection principle. Theorem 2 investigates Jensen’s subcompact cardinals and their relationship with stationary set reflection and the failure of the square principle.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

COUNTABLY NEAR PS-COMPACTNESS IN L-TOPOLOGICAL SPACES

In this paper, the concept of countably near PS-compactness inL-topological spaces is introduced, where L is a completely distributive latticewith an order-reversing involution. Countably near PS-compactness is definedfor arbitrary L-subsets and some of its fundamental properties are studied.

متن کامل

On Fuzzy $e$-open Sets, Fuzzy $e$-continuity and Fuzzy $e$-compactness in Intuitionistic Fuzzy Topological Spaces

The purpose of this paper is to introduce and study the concepts of fuzzy $e$-open set, fuzzy $e$-continuity and fuzzy $e$-compactness in intuitionistic fuzzy topological spaces. After giving the fundamental concepts of intuitionistic fuzzy sets and intuitionistic fuzzy topological spaces, we present intuitionistic fuzzy $e$-open sets and intuitionistic fuzzy $e$-continuity and other results re...

متن کامل

On Incompactness for Chromatic Number of Graphs Sh1006

We deal with incompactness. Assume the existence of non-reflecting stationary set of cofinality κ. We prove that one can define a graph G whose chromatic number is > κ, while the chromatic number of every subgraph

متن کامل

COUNTABLE COMPACTNESS AND THE LINDEL¨OF PROPERTY OF L-FUZZY SETS

In this paper, countable compactness and the Lindel¨of propertyare defined for L-fuzzy sets, where L is a complete de Morgan algebra. Theydon’t rely on the structure of the basis lattice L and no distributivity is requiredin L. A fuzzy compact L-set is countably compact and has the Lindel¨ofproperty. An L-set having the Lindel¨of property is countably compact if andonly if it is fuzzy compact. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004